Partially exchangeable processes indexed by the vertices of a k-tree constructed via reinforcement
نویسندگان
چکیده
منابع مشابه
A 3-Approximation for the Minimum Tree Spanning k Vertices
In this paper we give a 3-approximationalgorithm for the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices.
متن کاملExchangeable and partially exchangeable random partitions
Call a random partition of the positive integers partially exchangeable if for each finite sequence of positive integers n l , . . . , nk, the probability that the partition breaks the first nl + . . . § nk integers into k particular classes, of sizes nl . . . . , nk in order of their first elements, has the same value p(na . . . . . nk) for every possible choice of classes subject to the sizes...
متن کاملPartially Exchangeable Random Partitions
A random partition of the positive integers is called partially exchangeable if for each finite sequence of positive integers n,, ... , nk, the probability that the partition breaks the first n1 + + nk integers into k particular classes, of sizes nl,.. . ., nk in order of their first elements, has the same value p(nl,...,nk) for every possible choice of classes subject to the sizes constraint. ...
متن کاملInfinitely Exchangeable Partition and Tree-valued Stochastic Processes
We discuss some aspects of infinitely exchangeable partition-valued stochastic processes. In particular, we introduce the the cut-and-paste process on the state space of partitions of the natural numbers whose sample paths differ from previously studied exchangeable coalescent (Kingman, 1982) and fragmentation (Bertoin, 2001) processes. Though it evolves differently, the cut-and-paste process p...
متن کاملThe Distribution of Partially Exchangeable Random Variables
In this article, we derive the distribution of partially exchangeable binary random variables, generalizing the distribution of exchangeable binary random variables and hence the binomial distribution. The distribution can also be viewed as a mixture of Markov chains. We introduce rectangular complete monotonicity and show that partial exchangebility can be characterized by rectangular complete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2005
ISSN: 0304-4149
DOI: 10.1016/j.spa.2004.11.004